Degree versions of the Erdős–Ko–Rado theorem and Erdős hypergraph matching conjecture
نویسندگان
چکیده
منابع مشابه
Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
We use an algebraic method to prove a degree version of the celebrated Erdős-Ko-Rado theorem: given n > 2k, every intersecting k-uniform hypergraph H on n vertices contains a vertex that lies on at most ( n−2 k−2 ) edges. This result implies the Erdős-Ko-Rado Theorem as a corollary. It can also be viewed as a special case of the degree version of a well-known conjecture of Erdős on hypergraph m...
متن کاملDistributed storage allocations and a hypergraph conjecture of Erdős
We study two variations of the distributed storage allocation problem. The goal is to allocate a given storage budget in a distributed storage system for maximum reliability. It was recently discovered that this problem is related to an old conjecture in extremal combinatorics, on the maximum number of edges in a hypergraph subject to a constraint on its maximum matching number. The conjecture ...
متن کاملImproved bounds for Erdős' Matching Conjecture
Article history: Received 7 June 2012 Available online 24 February 2013
متن کاملAdjusting a conjecture of Erdős
We investigate a conjecture of Paul Erdős, the last unsolved problem among those proposed in his landmark paper [2]. The conjecture states that there exists an absolute constant C > 0 such that, if v1, . . . , vn are unit vectors in a Hilbert space, then at least C 2 n of all ∈ {−1, 1} are such that | Pn i=1 ivi |≤ 1. We disprove the conjecture. For Hilbert spaces of dimension d > 2, the counte...
متن کاملEmbedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
We establish an inclusion relation between two uniform models of random k-graphs (for constant k ≥ 2) on n labeled vertices: G(k)(n,m), the random k-graph with m edges, and R(k)(n, d), the random d-regular k-graph. We show that if n log n m nk we can choose d = d(n) ∼ km/n and couple G(k)(n,m) and R(k)(n, d) so that the latter contains the former with probability tending to one as n → ∞. This e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2017
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2017.03.006